A Ranking Algorithm for Re-finding

نویسنده

  • Gangli Liu
چکیده

Re-finding files from a personal computer is a frequent demand to users. When encountered a difficult re-finding task, people may not recall the attributes used by conventional refinding methods, such as a file’s path, file name, keywords etc., the re-finding would fail. We proposed a method to support difficult re-finding tasks. By asking the user a list of questions about the target, such as a document’s pages, author numbers, accumulated reading time, last reading location etc. Then use the user’s answers to filter out the target. After the user answered a list of questions about the target file, we evaluate the user’s familiar degree about the target file based on the answers. We devise a ranking algorithm which sorts the candidates by comparing the user’s familiarity degree about the target and the candidates. We also propose a method to generate re-finding tasks artificially based on the user’s own document corpus. Author

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A full ranking method using integrated DEA models and its application to modify GA for finding Pareto optimal solution of MOP problem

This paper uses integrated Data Envelopment Analysis (DEA) models to rank all extreme and non-extreme efficient Decision Making Units (DMUs) and then applies integrated DEA ranking method as a criterion to modify Genetic Algorithm (GA) for finding Pareto optimal solutions of a Multi Objective Programming (MOP) problem. The researchers have used ranking method as a shortcut way to modify GA to d...

متن کامل

Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...

متن کامل

Hybrid Probabilistic Search Methods for Simulation Optimization

Discrete-event simulation based optimization is the process of finding the optimum design of a stochastic system when the performance measure(s) could only be estimated via simulation. Randomness in simulation outputs often challenges the correct selection of the optimum. We propose an algorithm that merges Ranking and Selection procedures with a large class of random search methods for continu...

متن کامل

Learning to Rank Answers to Why-Questions

The goal of the current research project is to develop a ques­ tion answering system for answering why-questions (why QA). Our system is a pipeline consisting of an off-the-shelf retrieval module followed by an answer re-ranking module. In this paper, we aim at improving the ranking performance of our system by finding the optimal approach to learning to rank. More specifically, we try to find ...

متن کامل

Solving Single Phase Fluid Flow Instability Equations Using Chebyshev Tau- QZ Polynomial

In this article the instability of single phase flow in a circular pipe from laminar to turbulence regime has been investigated. To this end, after finding boundary conditions and equation related to instability of flow in cylindrical coordination system, which is called eigenvalue Orr Sommerfeld equation, the solution method for these equation has been investigated. In this article Chebyshev p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1602.05157  شماره 

صفحات  -

تاریخ انتشار 2016